Structural stability of invasion graphs for Lotka-Volterra systems.

In this paper, we study in detail the structure of the global attractor for the Lotka-Volterra system with a Volterra-Lyapunov stable structural matrix. We consider the invasion graph as recently introduced in Hofbauer and Schreiber (J Math Biol 85:54, 2022) and prove that its edges represent all the heteroclinic connections between the equilibria of the system. We also study the stability of this structure with respect to the perturbation of the problem parameters. This allows us to introduce a definition of structural stability in ecology in coherence with the classical mathematical concept where there exists a detailed geometrical structure, robust under perturbation, that governs the transient and asymptotic dynamics.

What lies underneath: Precise classification of brain states using time-dependent topological structure of dynamics.

The self-organising global dynamics underlying brain states emerge from complex recursive nonlinear interactions between interconnected brain regions. Until now, most efforts of capturing the causal mechanistic generating principles have supposed underlying stationarity, being unable to describe the non-stationarity of brain dynamics, i.e. time-dependent changes. Here, we present a novel framework able to characterise brain states with high specificity, precisely by modelling the time-dependent dynamics. Through describing a topological structure associated to the brain state at each moment in time (its attractor or 'information structure'), we are able to classify different brain states by using the statistics across time of these structures hitherto hidden in the neuroimaging dynamics. Proving the strong potential of this framework, we were able to classify resting-state BOLD fMRI signals from two classes of post-comatose patients (minimally conscious state and unresponsive wakefulness syndrome) compared with healthy controls with very high precision.

Global structural stability and the role of cooperation in mutualistic systems.

Dynamical systems on graphs allow to describe multiple phenomena from different areas of Science. In particular, many complex systems in Ecology are studied by this approach. In this paper we analize the mathematical framework for the study of the structural stability of each stationary point, feasible or not, introducing a generalization for this concept, defined as Global Structural Stability. This approach would fit with the proper mathematical concept of structural stability, in which we find a full description of the complex dynamics on the phase space due to nonlinear dynamics. This fact can be analyzed as an informational field grounded in a global attractor whose structure can be completely characterized. These attractors are stable under perturbation and suppose the minimal structurally stable sets. We also study in detail, mathematically and computationally, the zones characterizing different levels of biodiversity in bipartite graphs describing mutualistic antagonistic systems of population dynamics. In particular, we investigate the dependence of the region of maximal biodiversity of a system on its connectivity matrix. On the other hand, as the network topology does not completely determine the robustness of the dynamics of a complex network, we study the correlation between structural stability and several graph measures. A systematic study on synthetic and biological graphs is presented, including 10 mutualistic networks of plants and seed-dispersal and 1000 random synthetic networks. We compare the role of centrality measures and modularity, concluding the importance of just cooperation strength among nodes when describing areas of maximal biodiversity. Indeed, we show that cooperation parameters are the central role for biodiversity while other measures act as secondary supporting functions.

Informational Structures and Informational Fields as a Prototype for the Description of Postulates of the Integrated Information Theory.

Informational Structures (IS) and Informational Fields (IF) have been recently introduced to deal with a continuous dynamical systems-based approach to Integrated Information Theory (IIT). IS and IF contain all the geometrical and topological constraints in the phase space. This allows one to characterize all the past and future dynamical scenarios for a system in any particular state. In this paper, we develop further steps in this direction, describing a proper continuous framework for an abstract formulation, which could serve as a prototype of the IIT postulates.

Informational structures: A dynamical system approach for integrated information.

Integrated Information Theory (IIT) has become nowadays the most sensible general theory of consciousness. In addition to very important statements, it opens the door for an abstract (mathematical) formulation of the theory. Given a mechanism in a particular state, IIT identifies a conscious experience with a conceptual structure, an informational object which exists, is composed of identified parts, is informative, integrated and maximally irreducible. This paper introduces a space-time continuous version of the concept of integrated information. To this aim, a graph and a dynamical systems treatment is used to define, for a given mechanism in a state for which a dynamics is settled, an Informational Structure, which is associated to the global attractor at each time of the system. By definition, the informational structure determines all the past and future behavior of the system, possesses an informational nature and, moreover, enriches all the points of the phase space with cause-effect power by means of its associated Informational Field. A detailed description of its inner structure by invariants and connections between them allows to associate a transition probability matrix to each informational structure and to develop a measure for the level of integrated information of the system.

A Decomposition Method for Global Evaluation of Shannon Entropy and Local Estimations of Algorithmic Complexity.

We investigate the properties of a Block Decomposition Method (BDM), which extends the power of a Coding Theorem Method (CTM) that approximates local estimations of algorithmic complexity based on Solomonoff-Levin's theory of algorithmic probability providing a closer connection to algorithmic complexity than previous attempts based on statistical regularities such as popular lossless compression schemes. The strategy behind BDM is to find small computer programs that produce the components of a larger, decomposed object. The set of short computer programs can then be artfully arranged in sequence so as to produce the original object. We show that the method provides efficient estimations of algorithmic complexity but that it performs like Shannon entropy when it loses accuracy. We estimate errors and study the behaviour of BDM for different boundary conditions, all of which are compared and assessed in detail. The measure may be adapted for use with more multi-dimensional objects than strings, objects such as arrays and tensors. To test the measure we demonstrate the power of CTM on low algorithmic-randomness objects that are assigned maximal entropy (e.g., π ) but whose numerical approximations are closer to the theoretical low algorithmic-randomness expectation. We also test the measure on larger objects including dual, isomorphic and cospectral graphs for which we know that algorithmic randomness is low. We also release implementations of the methods in most major programming languages-Wolfram Language (Mathematica), Matlab, R, Perl, Python, Pascal, C++, and Haskell-and an online algorithmic complexity calculator.

Human behavioral complexity peaks at age 25.

Random Item Generation tasks (RIG) are commonly used to assess high cognitive abilities such as inhibition or sustained attention. They also draw upon our approximate sense of complexity. A detrimental effect of aging on pseudo-random productions has been demonstrated for some tasks, but little is as yet known about the developmental curve of cognitive complexity over the lifespan. We investigate the complexity trajectory across the lifespan of human responses to five common RIG tasks, using a large sample (n = 3429). Our main finding is that the developmental curve of the estimated algorithmic complexity of responses is similar to what may be expected of a measure of higher cognitive abilities, with a performance peak around 25 and a decline starting around 60, suggesting that RIG tasks yield good estimates of such cognitive abilities. Our study illustrates that very short strings of, i.e., 10 items, are sufficient to have their complexity reliably estimated and to allow the documentation of an age-dependent decline in the approximate sense of complexity.

A preference for some types of complexity comment on "perceived beauty of random texture patterns: A preference for complexity".

In two experiments, Friedenberg and Liby (2016) studied how a diversity of complexity estimates such as density, number of blocks, GIF compression rate and edge length impact the perception of beauty of semi-random two-dimensional patterns. They concluded that aesthetics ratings are positively linked with GIF compression metrics and edge length, but not with the number of blocks. They also found an inverse U-shaped link between aesthetic judgments and density. These mixed results originate in the variety of metrics used to estimate what is loosely called "complexity" in psychology and indeed refers to conflicting notions. Here, we reanalyze their data adding two more conventional and normative mathematical measures of complexity: entropy and algorithmic complexity. We show that their results can be interpreted as an aesthetic preference for low redundancy, balanced patterns and "crooked" figures, but not for high algorithmic complexity. We conclude that participants tend to have a preference for some types of complexity, but not for all. These findings may help understand divergent results in the study of perceived beauty and complexity, and illustrate the need to specify the notion of complexity used in psychology. The field would certainly benefit from a precise taxonomy of complexity measures.

Algorithmic complexity for psychology: a user-friendly implementation of the coding theorem method.

Kolmogorov-Chaitin complexity has long been believed to be impossible to approximate when it comes to short sequences (e.g. of length 5-50). However, with the newly developed coding theorem method the complexity of strings of length 2-11 can now be numerically estimated. We present the theoretical basis of algorithmic complexity for short strings (ACSS) and describe an R-package providing functions based on ACSS that will cover psychologists' needs and improve upon previous methods in three ways: (1) ACSS is now available not only for binary strings, but for strings based on up to 9 different symbols, (2) ACSS no longer requires time-consuming computing, and (3) a new approach based on ACSS gives access to an estimation of the complexity of strings of any length. Finally, three illustrative examples show how these tools can be applied to psychology.

Calculating Kolmogorov complexity from the output frequency distributions of small Turing machines.

Drawing on various notions from theoretical computer science, we present a novel numerical approach, motivated by the notion of algorithmic probability, to the problem of approximating the Kolmogorov-Chaitin complexity of short strings. The method is an alternative to the traditional lossless compression algorithms, which it may complement, the two being serviceable for different string lengths. We provide a thorough analysis for all Σ(n=1)(11) 2(n) binary strings of length n<12 and for most strings of length 12≤n≤16 by running all ~2.5 x 10(13) Turing machines with 5 states and 2 symbols (8 x 22(9) with reduction techniques) using the most standard formalism of Turing machines, used in for example the Busy Beaver problem. We address the question of stability and error estimation, the sensitivity of the continued application of the method for wider coverage and better accuracy, and provide statistical evidence suggesting robustness. As with compression algorithms, this work promises to deliver a range of applications, and to provide insight into the question of complexity calculation of finite (and short) strings. Additional material can be found at the Algorithmic Nature Group website at http://www.algorithmicnature.org. An Online Algorithmic Complexity Calculator implementing this technique and making the data available to the research community is accessible at http://www.complexitycalculator.com.

Algorithmic complexity for short binary strings applied to psychology: a primer.

As human randomness production has come to be more closely studied and used to assess executive functions (especially inhibition), many normative measures for assessing the degree to which a sequence is randomlike have been suggested. However, each of these measures focuses on one feature of randomness, leading researchers to have to use multiple measures. Although algorithmic complexity has been suggested as a means for overcoming this inconvenience, it has never been used, because standard Kolmogorov complexity is inapplicable to short strings (e.g., of length l ≤ 50), due to both computational and theoretical limitations. Here, we describe a novel technique (the coding theorem method) based on the calculation of a universal distribution, which yields an objective and universal measure of algorithmic complexity for short strings that approximates Kolmogorov-Chaitin complexity.